HyCube: A distributed hash table based on a variable metric
نویسندگان
چکیده
منابع مشابه
A Distributed Hash Table
DHash is a new system that harnesses the storage and network resources of computers distributed across the Internet by providing a wide-area storage service, DHash. DHash frees applications from re-implementing mechanisms common to any system that stores data on a collection of machines: it maintains a mapping of objects to servers, replicates data for durability, and balances load across parti...
متن کاملMaidSafe Distributed Hash Table
An effective distributed network requires an addressing mechanism and distribution of data that is designed to overcome churn (the unmanageable outage, node failure or unforeseen communication fault). There are several implementations of such a system, but this paper proposes a system that not only provides an efficient churn-resistant DHT, but also has fast awareness of infrastructure changes....
متن کاملA Distributed Control Plane for the Internet of Things Based on a Distributed Hash Table
As any other communication system, the Internet of Things (IoT) requires a functional control plane. However developing such control plane in a centralized way presents a number of challenges given the multiple stakeholders, the huge number of devices distributed worldwide, their limited connectivity, and specially that most IoT devices are battery-powered and thus must be sleeping most of the ...
متن کاملCHR : a Distributed Hash Table for Wireless
This paper focuses on the problem of implementing a distributed hash table (DHT) in wireless ad hoc networks. Scarceness of resources and node mobility turn routing into a challenging problem and therefore, we claim that building a DHT as an overlay network (like in wired environments) is not the best option. Hence, we present a proof-of-concept DHT, called Cell Hash Routing (CHR), designed fro...
متن کاملA Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of logn and is robust under random deletion of nodes. The second has parallel time of logn and message complexity of log2 n. It is robust under spam induced by a random subset of the nodes. We then show a construction which is fault tole...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Peer-to-Peer Networking and Applications
سال: 2016
ISSN: 1936-6442,1936-6450
DOI: 10.1007/s12083-016-0455-2